class TreeNode{
	int value;
	TreeNode left;
	TreeNode rigth;
	List c=new ArrayList();
	private static min;
	private static max;

	public void recurseNodeWithRange(Node root){
		if (root.left != null){
		  recurseNode(root.left)
		  }
		if (root.getValue()<min || root.getValue>max) {
		   return
		}else{
		   c.add(root.getValue())
		}

		
		if (root.right != null){
		  recurseNode(root.right)
		  }
	}

	public recurseNode(Node root){
		if (root.left != null){
			recurseNode(root.left)
		}

		c.add(root.getValue())
		
		if (root.right != null){
		  recurseNode(root.right)
		}
	}

}
